Some consequences of non-uniform conditions on uniform classes
نویسندگان
چکیده
منابع مشابه
Some Connections Between Bounded Query Classes and Non-Uniform Complexity
Consider the function F A k (x 1 ; : : :; x k) = A(x 1) A(x k). We show that if F A k can be computed with less than k queries to some set X then A 2 P=poly. A generalization of this result has applications to bounded query classes, circuits, and enumerability. In particular we obtain the following. (1) Assuming p 3 6 = p 3 the hierarchy of functions computed with a bounded number of queries to...
متن کاملNew Non-Uniform Lower Bounds for Uniform Classes
We strengthen the nondeterministic hierarchy theorem for non-deterministic polynomial time to show that the lower bound holds against sub-linear advice. More formally, we show that for any constants d and d′ such that 1 6 d < d′, and for any time-constructible bound t = o(n), there is a language in NTIME(n) which is not in NTIME(t)/n1/d . The best known earlier separation of Fortnow, Santhanam ...
متن کاملInstruction sequence based non-uniform complexity classes
We present an approach to non-uniform complexity in which singlepass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes. One kind includes a counterpart of the well-known non-uniform complexity class P/poly and another kind includes a counterpart of the well-known non-uniform complexity ...
متن کاملOn the Uniform Convergence in Some Classes of Non-necessarily Continuous Functions
We consider some classes of non-necessarily continuous functions which have played a role in a recent literature on optimization and non-cooperative game theory. With respect to the uniform convergence metric, we prove that the limit of a converging sequence of weakly pseudocontinuous functions is weakly pseudocontinuous, but the similar property is not verified for functions which are either t...
متن کاملUniform Glivenko–Cantelli Classes
A class of sets, or functions, is said to be P–Glivenko–Cantelli if the empirical measure Pn converges in some sense to the true measure, P , as n → ∞, uniformly over the class of sets or functions. Thus, the notions of Glivenko–Cantelli, and likewise uniform Glivenko–Cantelli are for the most part qualitative assessments of how “well–behaved” a collection of sets or functions is, in the sense ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1983
ISSN: 0304-3975
DOI: 10.1016/0304-3975(83)90020-8